Differential Resultants and Subresultants

نویسنده

  • Marc Chardin
چکیده

Consider two differential operators L1 = ∑ aid i and L2 = ∑ bjd j with coefficients in a differential field, say C(t) with d = ∂ ∂t for example. If the ai and bj are constants, the condition for the existence of a solution y of L1(y) = L2(y) = 0 is that the resultant in X of the polynomials (in C[X]) ∑ aiX i and ∑ bjX j is zero. A natural question is: how one could extend this for the case of non constant coefficients ? One of the main motivation in the resultant techniques is the universality of the computation result. When you calculate the resultant, or the subresultants, you always stay in the ring where the coefficients lies and the result can be specialized to every particular case (if the equations depends on parameters for example) to get the information in theses cases. In this paper, we define all the differential equivalents of these classical objects. In theorem 4 we describe the universal properties of the differential subresultants. They are due to the fact that, as in the polynomial case, we can work out the problem by means of linear algebra. As it was known by Ritt ([R]), the differential resultant is a polynomial in the ai, bj and their derivatives that tells us—in the general algebraic context of linear differential equations over a differential field—if they have a common solution. In particular, if you know in a given context that there exists a base of solutions (e.g. you have C∞ coefficients and you work locally (Cauchy’s theorem)), this universal calculation answers this existence problem in this particular context. We here give a Sylvester style expression for the resultant and the subresultants. So, as theses objects are determinants, you can get size information on them if you have any reasonable notion of size in the differential ring and, as a corollary, complexity estimates for the calculation. At least three techniques may be used: Gauss elimination type techniques (e.g. the Bareiss algorithm) if the ring does not contain zero divisors, Berkowitz fast parallel algorithm ([Be]) or the natural extension of the subresultant algorithm. As in the classical case, the differential resultant can be expressed in terms of the values of one of the operators on a base of the solutions of the other, we exhibit this formula and most of the differential equivalents of the classical ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resultants and subresultants of p-adic polynomials

We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are highly unstable on average and we explain, in many cases, how one can stabilize them without sacrifying the complexity. On the way, we completely determine the d...

متن کامل

Subresultants Under Composition

It is a well known fact that the resultants are invariant under translation. We extend this fact to arbitrary composition (where a translation is a particular composition with a linear monic polynomial), and to arbitrary subresultants (where the resultant is the 0-th subresultant).

متن کامل

Symmetric Subresultants and Applications

Schur’s transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we show that they satisfy a structure theorem which allows us to compute them with a type of Euclidean division. As a consequence, a fast algorithm based on a dich...

متن کامل

Resultants and Subresultants: Univariate vs. Multivariate Case

It is very well-known that this system has a non-trivial solution if and only if AD −BC equals to zero. One can generalize the previous situation in two different directions. The most classical one is the notion of determinant, which is the condition under which a system of n homogeneous equations in n unknowns    A11x1 + A12x2 + . . . + A1nxn = 0 A21x1 + A22x2 + . . . + A2nxn = 0 .. .. ...

متن کامل

Linear complete differential resultants and the implicitization of linear DPPEs

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of n linear differential polynomial parametric equations in n− 1 differential parameters. We give necessary conditions to ensure properness of the system of differential polynom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991